Multi-Agent System for solving Dynamic Operating Theater Facility Layout Problem

نویسندگان

  • Abdelahad CHRAIBI
  • Said KHARRAJA
  • Ibrahim H. OSMAN
  • Omar ELBEQQALI
چکیده

The Operating Theater (OT) is known to be a fluctuating production system. The unpredictability of populations’ needs has an impact on the required human and material resources and makes the Operating Theater a dynamic environment. Thus, the use of dynamic models is getting more realistic to solve OT Layout Problem (OTLP). While solving Dynamic OTLP, Real-life Operating Theater (OT) sizes are larger than exact methods capacity, this lead to explore other methods as heuristics, metaheuristics or parallel treatment looking for approximate solutions. In this paper, we developed a novel approach using a Multi-Agent (MA) Decision Making System (DMS) based on a Quadratic Assignment Problem (QAP) and a Mixed Integer Linear Programming (MILP) for large-sized DOTLP with objective of minimizing total traveling costs and minimizing the rearrangement costs, by studying an individual layout for each distinctive period based on patients demand. The DMS generates efficient solutions in reasonable time and gives the final OT layouts in a graphic interface. Keywords— Dynamic Facility Layout Problem, Multi-Agent Systems; MILP, QAP, Operating Theater

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA

A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...

متن کامل

ارائه یک الگوریتم هوشمند ترکیبی جهت حل مسئله چیدمان پویای تسهیلات با اطلاعات جریان فازی

The dynamic facility layout problem involves the design of facility layouts in which the flows of materials between activities can change during a multi-period planning horizon. In the static layout problem, it is assumed that all the activities are constant. However, in today’s volatile markets, the business conditions are changing. So the similar changes are imposed on the facility projects a...

متن کامل

Multi-start simulated annealing for dynamic plant layout problem

In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...

متن کامل

Applications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)

Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

متن کامل

A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015